Perturbative method for generalized spectral decompositions
نویسندگان
چکیده
منابع مشابه
Spectral division methods for block generalized Schur decompositions
We provide a different perspective of the spectral division methods for block generalized Schur decompositions of matrix pairs. The new approach exposes more algebraic structures of the successive matrix pairs in the spectral division iterations and reveals some potential computational difficulties. We present modified algorithms to reduce the arithmetic cost by nearly 50%, remove inconsistency...
متن کاملNew Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions
Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus man...
متن کاملScalable Constrained Clustering: A Generalized Spectral Method
We present a principled spectral approach to the wellstudied constrained clustering problem. It reduces clustering to a generalized eigenvalue problem on Laplacians. The method works in nearly-linear time and provides concrete guarantees for the quality of the clusters, at least for the case of 2-way partitioning. In practice this translates to a very fast implementation that consistently outpe...
متن کاملA Provable Generalized Tensor Spectral Method for Uniform Hypergraph Partitioning
Matrix spectral methods play an important role in statistics and machine learning, and most often the word ‘matrix’ is dropped as, by default, one assumes that similarities or affinities are measured between two points, thereby resulting in similarity matrices. However, recent challenges in computer vision and text mining have necessitated the use of multi-way affinities in the learning methods...
متن کاملGenetic algorithms for generalized hypertree decompositions
Many practical problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Although CSPs are NP-hard in general, it has been proven that instances of CSPs may be solved efficiently, if they have generalized hypertree decompositions of small width. Unfortunately, finding a generalized hypertree decomposition of minimum width is an NP-hard problem. B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 1999
ISSN: 0378-4371
DOI: 10.1016/s0378-4371(99)00215-0